Near-Linear Approximation Algorithms for Geometric Hitting Sets
نویسندگان
چکیده
منابع مشابه
A Near-Linear Time ε-Approximation Algorithm for Geometric Bipartite
For point sets A,B ⊂ R, |A| = |B| = n, and for a parameter ε > 0, we present a Monte Carlo algorithm that computes, in O(npoly(log n, 1/ε)) time, an ε-approximate perfect matching of A and B under any Lp-norm with high probability; the previously best known algorithm takes Ω(n) time. We approximate the Lp-norm using a distance function, d(·, ·) based on a randomly shifted quad-tree. The algorit...
متن کاملGeometric Set Cover and Hitting Sets for Polytopes in R
Suppose we are given a finite set of points P in R and a collection of polytopes T that are all translates of the same polytope T . We consider two problems in this paper. The first is the set cover problem where we want to select a minimal number of polytopes from the collection T such that their union covers all input points P . The second problem that we consider is finding a hitting set for...
متن کاملGeometric Set Cover and Hitting Sets for Polytopes in R3
Suppose we are given a finite set of points P in R 3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The first is the set cover problem where we want to select a minimal number of polytopes from the collection T such that their union covers all input points P. The second problem that we consider is finding a hitting set for...
متن کاملGeometric Hitting Sets for Disks: Theory and Practice
The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a small-sized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [6] made an important connection of this problem to the size of fundamental combinatorial structures called -nets, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9517-2